un 2 00 6 Frugality ratios and improved truthful mechanisms for vertex cover ∗
نویسندگان
چکیده
منابع مشابه
Using Nash Implementation to Achieve Better Frugality Ratios
Most of the recent works on algorithmic mechanism design exploit the solution concept of dominant strategy equilibria. Such work designs a proper payment scheme so that selfish agents maximize their utility by truthfully revealing their types. It has been pointed out that these truthful mechanisms, the famous among them being the VCG mechanisms, often incur high payments and fruglity ratios. In...
متن کاملTruthful Mechanism Design for Multidimensional Covering Problems
We investigate multidimensional covering mechanism-design problems, wherein there are m items that need to be covered and n agents who provide covering objects, with each agent i having a private cost for the covering objects he provides. The goal is to select a set of covering objects of minimum total cost that together cover all the items. We focus on two representative covering problems: unc...
متن کاملCommodity Auctions and Frugality Ratios
We study set-system auctions whereby a single buyer wants to purchase Q items of some commodity. There are multiple sellers, each of whom has some known number of items, and a private cost for supplying those items. Thus a “feasible set” of sellers (a set that is able to comprise the winning bidders) is any set of sellers whose total quantity sums to at least Q. We show that, even in a limited ...
متن کاملOn the Price of Truthfulness in Path Auctions
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In particular we consider the fundamental case that the graph is composed of two node-disjoint s-t-paths of length s1 and s2 respectively, and prove an optimal √ s1s2 lower bound (an improvement over √ s1s2/2). This implies t...
متن کاملFrugal Routing on Wireless Ad-Hoc Networks
We study game-theoretic mechanisms for routing in ad-hoc networks. Game-theoretic mechanisms capture the non-cooperative and selfish behavior of nodes in a resource-constrained environment. There have been some recent proposals to use incentive-based mechanisms (in particular, VCG) for routing in wireless ad-hoc networks, and some frugality bounds are known when the connectivity graph is essent...
متن کامل